James Aspnes

#	Item
31	The Complexity of Renaming Dan Alistarh EPFL James Aspnes Yale Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2011-11-17 23:45:06 Computer science Computational complexity theory Algorithm Mathematical logic Randomized algorithm Time complexity Adversary model Distributed computing Quantum algorithm Theoretical computer science Applied mathematics Analysis of algorithms
32	Abstract of “ Toward Practical Planar Graph Algorithms ” by David Elliot Eisenstat, Ph.D., Brown University, May 2014 Many optimization problems involving graphs naturally feature road networks, grids, or other large Add to Reading List Source URL: www.davideisenstat.com Language: English - Date: 2015-01-19 22:58:16 Computational learning theory Dana Angluin Applied mathematics Michael L. Scott Computing Year of birth missing James Aspnes Computer science
33	Stably Computable Predicates are Semilinear Dana Angluin James Aspnes Department of Computer Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2015-02-03 22:51:46 Group theory Functions and mappings Lemmas Linear algebra Category theory Monoid Function Coset Pumping lemma for context-free languages Mathematics Algebra Abstract algebra